Asynchronous Forward-checking for DisCSPs
نویسندگان
چکیده
منابع مشابه
Asynchronous Forward-Checking on DisCSPs
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assi...
متن کاملAsynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...
متن کاملAsynchronous Backtracking for Asymmetric DisCSPs
Distributed constraint satisfaction problems (DisCSPs) with asymmetric constraints reflect the fact that agents may wish to retain their constraints private. The set of valid pairs of values of every binary constraint is split between the two constrained agents. An asynchronous backtracking algorithm for asymmetric DisCSPs is presented. The new algorithm is based on asynchronous backtracking (A...
متن کاملAsynchronous Search for Numeric DisCSPs
In Distributed CSPs (DisCSPs), agents may want to keep parts of their problem secret but accept to cooperate by exchanging proposals. Asynchronism in solving DisCSPs [1] increases flexibility, parallelism, and robustness. Enumerative algorithms apply for discrete problems with small domains. Our goal is to develop asynchronous algorithms that can deal with numeric constraints. Centralized techn...
متن کاملSynchronous, Asynchronous and Hybrid Algorithms for DisCSPs?
There is some debate about the kind of algorithms that are most suitable to solve DisCSP. Synchronous algorithms exchange updated information with a low degree of parallelism. Asynchronous algorithms use less updated information with a higher parallelism. Hybrid algorithms combine both features. Lately, there is some evidence that synchronous algorithms could be more efficient than asynchronous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2007
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-006-9013-5